Department of Mathematicscoretheory
DISCRETE MATHEMATICS
MAT 2138
Syllabus
- 01Sets and Sequences
- 02Introduction to Logic
- 03Propositional Logic
- 04Deduction
- 05Resolution
- 06Predicates and Quantifiers
- 07Relational Structures on Sets
- 08Relations & Graphs
- 09Equivalence Relations
- 10Functions
- 11Bijections
- 12Binary relations and Graphs
- 13Introduction to Graph Theory
- 14Boolean Algebras
- 15Sizes of Sets
- 16Counting & Combinatorics
- 17Pigeon Hole Principle
- 18Double Counting
- 19Linear Recurrence relations
- 20Generating Functions
- 21Permutations and counting
References
- An Introduction to Computational Combinatorics, E. S. Page, L. B. Wilson, Cambridge Press, 1979.
- Discrete Mathematics and its Applications - Kenneth H. Rosen 7th Edn.Tata McGraw Hill, 1988.
- Elements of Discrete Mathematics, C. L Liu, McGraw-Hill Inc., 1985.
- Applied Combinatorics, Alan Tucker, 2007.
- Concrete Mathematics, Ronald Graham, Donald Knuth, and Oren Patashnik, 2nd Edition - Pearson Education Publishers - 1996.
- Combinatorics: Topics, Techniques, Algorithms by Peter J. Cameron, Cambridge University Press, 1994 (reprinted 1996).
Credits Structure
2Lecture
1Tutorial
0Practical
3Total